Wishart distributions for decomposable graphs
نویسندگان
چکیده
منابع مشابه
Simulation of Hyper-Inverse Wishart Distributions for Non-decomposable Graphs
We propose an efficient solution to the problem of sampling from a hyperinverse Wishart distribution in non-decomposable graphs. The method relies on local computations based on the standard junction tree representation of graphs and distribution theoretical results of constraint Wishart matrices. We hope with this note to clarify a few confusing points that appeared in previous attempts to sol...
متن کاملOn Riesz and Wishart distributions associated with decomposable undirected graphs
Classical Wishart distributions on the open convex cones of positive definite matrices and their fundamental features are extended to generalized Riesz and Wishart distributions associated with decomposable undirected graphs using the basic theory of exponential families. The families of these distributions are parameterized by their expectations/natural parameter and multivariate shape paramet...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملWISHART DISTRIBUTIONS FOR COVARIANCE GRAPH MODELS By
Gaussian covariance graph models encode marginal independence among the components of a multivariate random vector by means of a graph G. These models are distinctly different from the traditional concentration graph models (often also referred to as Gaus-sian graphical models or covariance selection models), as the zeroes in the parameter are now reflected in the covariance matrix Σ, as compar...
متن کاملFast algorithms for decomposable graphs
A celebrated theorem by Courcelle states that every problem definable in monadic second-order logic (MSO) can be solved in linear time on graphs of bounded treewidth. This meta-theorem along with its extensions by Arnborg, Lagergren, and Seese as well as by Courcelle and Mosbah explains, why many important graph problems that are NP-hard on general graphs can be solved efficiently on tree-decom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2007
ISSN: 0090-5364
DOI: 10.1214/009053606000001235